Bounded Invariant Checking for Stateflow

Stateflow models are complex software models, often used as part of industrial safety-critical solutions designed with Matlab Simulink. Being solutions, these require the application rigorous verification techniques for assuring their correctness. In this paper, we propose a refutation-based formal approach analyzing against invariant properties, based on bounded model checking (BMC). The crux our technique is: i) representation state space symbolic transition system (STS) over configurations model, and ii) incremental BMC, to generate results after each unrolling next-state relation system. To end, develop structural operational semantics (SSOS) Stateflow, starting from an existing (SOS), show preservation properties between two. We define STS satisfiability problem. automated procedure generating initial predicates STS, prototype implementation in form tool utilising standard, off-the-shelf solvers. Finally, present preliminary performance by applying illustrative example two models.